Hyper-renormalization: Non-minimization Approach for Geometric Estimation
نویسندگان
چکیده
منابع مشابه
Optimization Techniques for Geometric Estimation: Beyond Minimization
We overview techniques for optimal geometric estimation from noisy observations for computer vision applications. We first describe estimation techniques based on minimization of given cost functions: least squares (LS), maximum likelihood (ML), which includes reprojection error minimization (Gold Standard) as a special case, and Sampson error minimization. We then formulate estimation techniqu...
متن کاملRenormalization Returns: Hyper-renormalization and Its Applications
The technique of “renormalization” for geometric estimation attracted much attention when it was proposed in early 1990s for having higher accuracy than any other then known methods. Later, it was replaced by minimization of the reprojection error. This paper points out that renormalization can be modified so that it outperforms reprojection error minimization. The key fact is that renormalizat...
متن کاملA NUMERICAL RENORMALIZATION GROUP APPROACH FOR AN ELECTRON-PHONON INTERACTION
A finite chain calculation in terms of Hubbard X-operators is explored by setting up a vibronic Harniltonian. The model conveniently transformed into a form so that in the case of strong coupling a numerical renormalization group approach is applicable. To test the technique, a one particle Green function is calculated for the model Harniltonian
متن کاملOptimal Hyper-Minimization
Minimal deterministic finite automata (dfas) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in time O(n logn), where n is the number of states of the input dfa, by [Gawrychowski and Jeż: Hyper-minimisation made efficient. Proc. Mfcs, Lncs 5734, 2009] and [Holzer and Maletti: An n logn algorithm for hyper-minim...
متن کاملNotes on Hyper-minimization
These notes report on recent advances in the relatively new area of hyper-minimization. Several open questions that were raised in the pioneering article [Badr, Geffert, and Shipman. Hyper-minimizing minimized deterministic finite state automata. RAIRO Theor. Inf. Appl., 43(1):69–94, 2009] are addressed here and the solutions, which are mostly taken from the literature, are presented in a unifo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Transactions on Computer Vision and Applications
سال: 2014
ISSN: 1882-6695
DOI: 10.2197/ipsjtcva.6.143